-function getDivisors(n) {
-  const divisors = [];
-
+function solution(n) {
+  let sum = 0;
   for (let i = 1; i * i <= n; i++) {
     if (n % i === 0) {
-      divisors.push(i);
+      sum += i;
       if (n / i !== i) {
-        divisors.push(n / i);
+        sum += n / i;
       }
     }
   }
-
-  return divisors;
+  return sum;
 }
 
-function solution(n) {
-  return getDivisors(n).reduce((acc, cur) => acc + cur, 0);
-}
-